Apparatus for decoding motion information in merge mode

ABSTRACT

Disclosed is an apparatus for decoding motion information in merge mode for reconstructing a moving picture signal coded at a low data rate while maintaining a high quality of an image. The apparatus for decoding motion information in merge mode discloses the position of a merge mode candidate and the configuration of a candidate in order to predict motion information in merge mode efficiently. Furthermore, a merge candidate indicated by the merge index of a current block can be efficiently reconstructed irrespective of a network environment by adaptively generating a merge candidate based on the number of valid merge candidate.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a Continuation of co-pending application Ser. No.13/745,288 filed on Jan. 18, 2013, which is the national phase of PCTInternational Application No. PCT/KR2012/000523 filed on Jan. 20, 2012,and which claims priority to Application No. 10-2011-0086524 filed inthe Republic of Korea on Aug. 29, 2011. The entire contents of all ofthe above applications are hereby incorporated by reference.

FIELD OF THE INVENTION

The present invention relates to an apparatus for decoding motioninformation and, more particularly, to an apparatus for decoding motioninformation in merge mode for reconstructing motion information coded inmerge mode.

DISCUSSION OF THE RELATED ART

Lots of techniques for effectively compressing a moving picture signalwhile maintaining the quality of an image have been proposed. Inparticular, an inter-prediction coding method, that is, a method ofextracting a block similar to a current block from a previous pictureand coding a difference between the extracted block and the currentblock, is one of the most effective methods in compressing an image.

In the case of the inter-prediction coding method, however, motioninformation corresponding to each block must be additionally transmittedinstead of coding a residual block and transmitting the coded residualblock. For this reason, another image compression method is to reducethe amount of data by effectively coding motion information.

As the size of a prediction block and the number of pictures to bereferred become diverse, the amount of data of a residual block isreduced, whereas the amount of motion information to be transmitted(e.g., a motion vector and a reference picture index) is graduallyincreased.

Accordingly, there is a need for an apparatus capable of reducing theamount of motion information to be transmitted more effectively.

SUMMARY OF THE INVENTION

The present invention provides an apparatus for decoding motioninformation in merge mode for effectively reconstructing motioninformation coded in merge mode.

The apparatus for decoding motion information in merge mode according tothe present invention includes a merge predictor index decoding unitconfigured to reconstruct the merge predictor index of a current blockusing a received merge codeword; a spatial merge candidate derivationunit configured to derive the spatial merge candidate of the currentblock; a temporal merge candidate configuration unit configured togenerate the temporal merge candidate of the current block; a mergecandidate generation unit configured to generate a merge candidate whenthe number of valid merge candidates of the current block is smallerthan a predetermined number; a merge predictor selection unit configuredto generate a list of merge candidates using the spatial merge candidatederived by the merge candidate derivation unit, the temporal mergecandidate generated by the temporal merge candidate configuration unit,and the merge candidate generated by the merge candidate generation unitand select a merge predictor based on the merge predictor indexreconstructed by the merge predictor index decoding unit; and a motioninformation generation unit configured to generate the reference pictureindex and motion vector of a merge candidate, selected by the mergepredictor selection unit, as the reference picture index and motionvector of the current block.

In accordance with the present invention, the merge predictor index of acurrent block is reconstructed and the spatial merge candidate and thetemporal merge candidate of the current block are generated, using areceived merge codeword. If the number of valid merge candidates of thecurrent block is smaller than a predetermined number, a list of mergecandidates is made by generating the merge candidates. Furthermore, amerge predictor is selected based on the reconstructed merge predictorindex. Accordingly, there are advantages in that a decoding speed can beincreased and motion information can be efficiently decoded because thenumber of merge candidates is fixed and one decoding table is used.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram of an inter-prediction encoding apparatusaccording to the present invention.

FIG. 2 is a block diagram of a motion information encoding modedetermination unit according to the present invention.

FIG. 3 is a diagram showing the position of a merge candidate inaccordance with an embodiment of the present invention.

FIG. 4 is a block diagram of an inter-prediction decoding apparatusaccording to the present invention.

FIG. 5 is a block diagram of a merge mode motion information decodingunit in accordance with a first embodiment of the present invention.

FIG. 6 is a block diagram of a merge mode motion information decodingunit in accordance with a second embodiment of the present invention.

FIG. 7 is a block diagram of a merge mode motion information decodingunit in accordance with a third embodiment of the present invention.

FIG. 8 is a block diagram of an AMVP mode motion information decodingunit in accordance with a first embodiment of the present invention.

FIG. 9 is a block diagram of an AMVP mode motion information decodingunit in accordance with a second embodiment of the present invention.

DESCRIPTION OF THE EMBODIMENTS

FIG. 1 is a block diagram of an inter-prediction encoding apparatusaccording to the present invention.

Referring to FIG. 1, the inter-prediction encoding apparatus includes amotion information determination unit 110, a motion information encodingmode determination unit 120, a motion information encoding unit 130, aprediction block generation unit 140, a residual block generation unit150, a residual block encoding unit 160, and a multiplexer 170. Themotion information determination unit 110 determines motion informationof a current block. The motion information includes a reference pictureindex and a motion vector. The reference picture index indicates any oneof previously coded and reconstructed pictures. If a current block isencoded using uni-prediction, the reference picture index indicates oneof reference pictures that belong to a list 0 L0. In contrast, if acurrent block is encoded using bi-prediction, the reference pictureindex may indicate one of the reference pictures included in a list 0 L0and one of the reference pictures included in a list 1 L1. Furthermore,if a current block is encoded using bi-prediction, the reference pictureindex may indicate one or two pictures of the reference picturesincluded in a complex list LC generated by combining a list 0 and a list1.

The motion vector indicates a position of a prediction block within apicture indicated by each reference picture index. The motion vector maybe a pixel unit (e.g., an integer pixel unit), and may also be asub-pixel unit. For example, the motion vector can have a resolution ofa ½, ¼, ⅛, or 1/16 pixel. If a motion vector is not an integer pixelunit, a prediction block is generated from integer pixels.

The motion information encoding mode determination unit 120 determineswhether motion information of a current block will be encoded in skipmode, merge mode, or AMVP mode.

Skip mode is applied when a skip candidate having the same motioninformation as a current block is present and a residual signal is 0.Furthermore, skip mode is applied when a current block has the same sizeas a coding unit. The current block can be considered to be a predictionunit.

Merge mode is applied when a merge candidate having the same motioninformation as a current block is present. Merge mode is applied when acurrent block has a different size from a coding unit or when a residualsignal is present if a current block has the same size as a coding unit.A merge candidate can be identical with a skip candidate.

AMVP mode is applied when skip mode and merge mode are not applied. AnAMVP candidate that has the most similar motion vector as a currentblock is selected as an AMVP predictor.

The motion information encoding unit 130 encodes motion information inaccordance with a method determined by the motion information encodingmode determination unit 120. If motion information encoding mode is skipmode or merge mode, the motion information encoding unit 130 performs amotion vector encoding process. If motion information encoding mode isAMVP mode, the motion information encoding unit 130 performs an AMVPencoding process.

The prediction block generation unit 140 generates a prediction blockusing motion information of a current block. If a motion vector is aninteger pixel unit, the prediction block generation unit 140 generatesthe prediction block of a current block by copying a block correspondingto a position that is indicated by a motion vector within a pictureindicated by a reference picture index.

If a motion vector is not an integer pixel unit, however, the predictionblock generation unit 140 generates pixels of a prediction block frominteger pixels within a picture indicated by a reference picture index.In this case, in the case of a luminance pixel, a prediction pixel canbe generated using an 8-tap interpolation filter. In the case of achrominance pixel, a prediction pixel can be generated using a 4-tapinterpolation filter.

The residual block generation unit 150 generates a residual block usinga current block and the prediction block of the current block. If acurrent block has a size of 2N×2N, the residual block generation unit150 generates a residual block using the current block and a predictionblock having a size of 2N×2N corresponding to the current block. If acurrent block used for prediction has a size of 2N×N or N×2N, theresidual block generation unit 150 can obtain a prediction block foreach of two 2N×N blocks that form the size of 2N×2N and then generate afinal prediction block having a size of 2N×2N using the two 2N×Nprediction blocks. Furthermore, the residual block generation unit 150may generate a residual block having a size of 2N×2N using a predictionblock having a size of 2N×2N. Pixels, located near a boundary of twoprediction blocks each having the size of 2N×N, can be overlap-smoothedin order to solve discontinuity at the boundary.

The residual block encoding unit 160 classifies a generated residualblock into one or more transform units. Furthermore, each of thetransform units is encoded by performing transform coding, quantization,and entropy coding. Here, a size of the transform unit can be determinedby a quadtree method depending on a size of the residual block.

The residual block encoding unit 160 transforms a residual block,generated by an inter-prediction method, using an integer-basedtransform matrix. The transform matrix is an integer-based DCT matrix.The residual block encoding unit 160 uses a quantization matrix in orderto quantize the coefficients of the residual block transformed by thetransform matrix. The quantization matrix is determined by aquantization parameter. The quantization parameter is determined foreach coding unit having a predetermined size or greater. Thepredetermined size can be 8×8 or 16×16. Accordingly, if a current codingunit is smaller than the predetermined size, only the quantizationparameter of a first coding unit in coding order, from among a pluralityof coding units within the predetermined size, is encoded and thequantization parameters of the remaining coding units do not need to beencoded because they are the same as the quantization parameter of thefirst coding unit. Furthermore, the coefficients of the transform blockare quantized using the determined quantization parameter and aquantization matrix determined depending on prediction mode.

A quantization parameter determined for each coding unit having thepredetermined size or greater is encoded by performing prediction codingusing the quantization parameter of a coding unit that neighbors acurrent coding unit. Quantization parameters can be searched for inorder of the left coding unit and the upper coding unit of the currentcoding unit, and a quantization parameter predictor of a current codingunit can be generated using one or two searched valid quantizationparameters. For example, a valid quantization parameter retrieved firstas described above can be determined as a quantization parameterpredictor. In another embodiment, quantization parameters can besearched for in order of a left coding unit and a coding unit rightbefore in coding order, and a valid quantization parameter retrievedfirst can be determined as a quantization parameter predictor.

The coefficients of a quantized transform block are scanned andtransformed into one-dimensional quantization coefficients. A scanningmethod can be set differently based on entropy coding mode. For example,in the case of Context-Based Adaptive Binary Arithmetic Coding (CABAC),quantization coefficients encoded using inter-prediction can be scannedusing a predetermined method (e.g., a zigzag scan or a diagonal rasterscan). In contrast, in the case of CAVLC, quantization coefficientsencoded using inter-prediction can be scanned using a different methodfrom the aforementioned method. For example, the scanning method can bedetermined based on the zigzag scan in the case of inter and can bedetermined based on intra-prediction mode in the case of intra.Furthermore, a coefficient scanning method may be determined differentlybased on the size of a transform unit. A scan pattern may vary dbased ona directional intra-prediction mode. The quantization coefficients arescanned in reverse order.

The multiplexer 170 multiplexes motion information encoded by the motioninformation encoding unit 130 and residual signals encoded by theresidual block encoding unit 160. The motion information may includedifferent information depending on coding mode. That is, in skip ormerge mode, the motion information includes only an index indicative ofa predictor. In contrast, in AMVP mode, the motion information includesa reference picture index, a differential motion vector, and an AMVPindex of a current block.

FIG. 2 is a block diagram of the motion information encoding modedetermination unit 120 according to the present invention.

The motion information encoding mode determination unit 120 according tothe present invention includes a spatial merge candidate derivation unit121, a reference picture index derivation unit 122 for a temporal mergecandidate, a motion vector derivation unit 123 for a temporal merge/AMVPcandidate, a motion vector derivation unit 124 for a spatial AMVPcandidate, a temporal merge candidate configuration unit 125, a mergecandidate list generation unit 126, an AMVP candidate list generationunit 127, and a coding mode determination unit 128.

The spatial merge candidate derivation unit 121 sets valid motioninformation on blocks neighboring a current block as spatial mergecandidates. Four candidates of the left block (e.g., a block A) of acurrent block, the upper block (e.g., a block B) of the current block,the upper right block (e.g., a block C) of the current block, the lowerleft block (e.g., a block D) of the current block, and the upper leftblock (e.g., a block E) of the current block can become the spatialmerge candidates, as shown in FIG. 3. In this case, the block E can beused when one or more of the blocks A, B, C, and D are not valid.

Furthermore, the left block (e.g., a block A′) of the current block, theupper block (e.g., a block B′) of the current block, and the cornerblock (e.g., any one of the blocks C, D, and E) of the current block canbe set as the spatial merge candidates. The corner block is the firstblock that is valid when scanning is performed in order of the upperright block (e.g., a block C) of the current block, the lower left block(e.g., a block D) of the current block, and the upper left block (e.g.,a block E) of the current block.

Furthermore, two candidates that are valid when scanning is performed inorder of the left block (e.g., a block A′) of the current block, theupper block (e.g., a block B′) of the current block, the upper rightblock (e.g., a block C) of the current block, the lower left block(e.g., a block D) of the current block, and the upper left block (e.g.,a block E) of the current block can become the spatial merge candidates.

Here, the left block A′ can be a block that does not neighbor the blockD, but neighbors the block E. Likewise, the upper block B′ can be ablock that does not neighbor the block C, but neighbors the block E.

The reference picture index derivation unit 122 for a temporal mergecandidate obtains a reference picture index for the temporal mergecandidates of a current block. The reference picture index of one ofblocks (e.g., prediction units) that spatially neighbor a current blockcan be set as the reference picture index for the temporal mergecandidates.

In order to obtain the reference indices of the temporal mergecandidates of the current block, some or all of the reference pictureindices of the left block A, the upper block B, the upper right block C,the lower left block D, and the upper left block E of the current blockcan be used.

For example, the reference picture indices of the left block A, theupper block B, and a corner block (e.g., any one of the blocks C, D, andE) of the current block can be used. In this case, the reference pictureindex of a block that is valid first when blocks are scanned in order ofthe upper right block C, the lower left block D, and the upper leftblock E can be determined as the reference picture index of the cornerblock. For example, a reference picture index having the highestfrequency, from among valid reference picture indices of the referencepicture indices, can be set as a reference picture index of a temporalskip candidate. If the number of reference picture indices having thehighest frequency, from among valid candidates, is plural, a referencepicture index having a minimum value, from among the plurality ofreference picture indices, can be set as a reference picture index forthe temporal skip candidate.

In order to obtain the reference indices of the temporal mergecandidates of the current block, the reference picture indices of threeblocks that are valid when blocks are scanned in order of the left blockA, the upper block B, the upper right block C, the lower left block D,and the upper left block E of the current block may be used. Althoughthree or more valid reference picture indices are illustrated as beingused, all the valid reference picture indices may be used or only areference picture index at a predetermined position may be used. Ifthere is no valid reference picture index, the reference picture indexmay be set to 0.

The motion vector derivation unit 123 for a temporal merge/AMVPcandidate determines a picture to which a temporal merge candidate blockbelongs (hereinafter referred to as a temporal merge candidate picture).The temporal merge candidate picture can be set as a picture having areference picture index of 0. In this case, if a slice type is P, thetemporal merge candidate picture is set as the first picture of a list 0(i.e., a picture having an index of 0). If a slice type is B, thetemporal merge candidate picture is set as the first picture of areference picture list indicated by a flag, the flag being indicative ofa temporal merge candidate list in a slice header. For example, thetemporal merge candidate picture can be set as a picture in a list 0when the flag is 1, and as a picture in a list 1 when the flag is 0.

The motion vector derivation unit 123 obtain a temporal merge candidateblock within the temporal merge candidate picture. One of a plurality ofcorresponding blocks corresponding to a current block within thetemporal merge candidate picture can be selected as the temporal mergecandidate block. In this case, the order of priority can be assigned tothe plurality of corresponding blocks, and a first valid correspondingblock can be selected as the temporal merge candidate block based on theorder of priority.

For example, a lower left corner block that neighbors a blockcorresponding to a current block within the temporal merge candidatepicture or a lower left block within a block corresponding to a currentblock within the temporal merge candidate picture can be set as a firstcandidate block, and a block that includes an upper left pixel at thecentral position of a block corresponding to a current block within thetemporal merge candidate picture or a block that includes a lower rightpixel at the central position of a block corresponding to a currentblock within the temporal merge candidate picture can be set as a secondcandidate block.

When the first candidate block is valid, the temporal merge candidateblock can be set as the first candidate block. When the first candidateblock is not valid and the second candidate block is valid, the temporalmerge candidate block can be set as the second candidate block. Inanother embodiment, only the second candidate block can be used based onthe position of a current block. For example, if a current block isadjacent to the lower boundary of a slice or the lower boundary of anLCU, only the second candidate block can be used. If the secondcandidate block is not present, the temporal merge candidate isdetermined not to be valid.

After the temporal merge candidate block is determined, a motion vectorof a temporal merge candidate is set as a motion vector of the temporalmerge candidate block.

Meanwhile, the temporal merge candidate may not be adaptively useddepending on the size of a current block. For example, in the case of a4×4 block, the temporal merge candidate may not be used in order toreduce complexity.

The motion vector derivation unit 124 for a spatial AMVP candidate canselect one of the left block (e.g., a block A) and the lower left block(e.g., a block D) of a current block as a left spatial candidate and canselect one of the upper block (e.g., a block B) of the current block,the upper right block (e.g., a block C) of the current block, and theupper left block (e.g., block E) of the current block as an upperspatial candidate. Here, a motion vector that is first valid when blocksare scanned in predetermined order is determined as the left or upperspatial candidate. The predetermined order can be order of the block Aand the block D or a reverse order thereof in the case of a left blockand can be order of the block B, the block C, and the block E or orderof the block C, the block B, and the block E in the case of an upperblock. The valid motion vector can be a motion vector that satisfies apredetermined condition. The predetermined condition is set based onmotion information of a current block. An upper spatial candidate maynot be set based on a left spatial candidate.

The temporal merge candidate configuration unit 125 generates a temporalmerge candidate using a reference picture index of the temporal mergecandidate obtained by the reference picture index derivation unit 122for the temporal merge candidate and a motion vector of the temporalmerge candidate obtained by the motion vector derivation unit 123 forthe temporal merge/AMVP candidate.

The merge candidate list generation unit 126 generates a list of mergecandidates in predetermined order using valid merge candidates. If aplurality of merge candidates has the same motion information (e.g., thesame motion vector and the same reference picture index), mergecandidates having lower order of priority are deleted from the list. Forexample, the predetermined order can be order of blocks A, B, Col, C,and D. Here, Col means a temporal merge candidate. If one or more of theblocks A, B, C, and D are not valid, motion information of a valid blockE can be inserted into the position of the invalid first block.Furthermore, the motion information of the valid block E can be insertedinto the last position.

Meanwhile, if the number of merge candidates is smaller than apredetermined number, a merge candidate can be generated. The addedmerge candidate can be generated by combining motion information on twovalid merge candidates. For example, a merge candidate can be generatedby combining a reference picture index of a temporal merge candidate anda valid spatial motion vector of a spatial merge candidate. If aplurality of merge candidates can be generated, the generated mergecandidates can be added to a list in predetermined order. A mergecandidate generated by combining the reference picture index of atemporal merge candidate and the motion vector of a spatial mergecandidate can be first added to the list. If the number of mergecandidates to be generated is insufficient, a merge candidate having amotion vector of 0 and a reference picture index of 0 may be added. Thepredetermined number can be determined for each picture or slice.

The AMVP candidate list generation unit 127 generates a list of AMVPcandidates in predetermined order using valid AMVP candidates. If aplurality of AMVP candidates has the same motion vector (but referencepictures need not to be the same), AMVP candidates having lower order ofpriority are deleted from the list. The predetermined order can be orderof the left side, the upper side, and Col or can be order of Col, theleft side, and the upper side.

Furthermore, the AMVP candidate list generation unit 127 determineswhether it is necessary to generate an AMVP candidate or not. Assumingthat the number of AMVP candidates is set to a fixed value in the aboveAMVP candidate configuration, if the number of valid AMVP candidates issmaller than the fixed value, an AMVP candidate is generated.Furthermore, the generated AMVP candidate is added to a position next toan AMVP candidate having the lowest order of priority in the list. Theadded AMVP candidate can be a candidate having a motion vector of 0.

The coding mode determination unit 128 determines whether motioninformation of a current block will be encoded in skip mode, merge mode,or AMVP mode.

Skip mode is applied when there is a skip candidate having the samemotion information as a current block and a residual signal is 0.Furthermore, skip mode is applied when a current block has the same sizeas a coding unit. The current block can be considered to be a predictionunit.

Merge mode is applied when a merge candidate having the same motioninformation as a current block is present. Merge mode is applied when acurrent block has a different size from a coding unit or when a residualsignal is present if a current block has the same size as a coding unit.A merge candidate can be identical with a skip candidate.

AMVP mode is applied when skip mode and merge mode are not applied. AnAMVP candidate that has the most similar motion vector as a currentblock is selected as an AMVP predictor.

FIG. 4 is a block diagram of an inter-prediction decoding apparatus 200according to the present invention.

The inter-prediction decoding apparatus 200 according to the presentinvention includes a demultiplexer 210, a motion information coding modedetermination unit 220, a merge mode motion information decoding unit230, an AMVP mode motion information decoding unit 240, a predictionblock generation unit 250, a residual block decoding unit 260, and areconstruction block generation unit 270.

The demultiplexer 210 demultiplexes coded motion information of acurrent block and coded residual signals from a received bit stream. Thedemultiplexer 210 transmits the demultiplexed motion information to themotion information coding mode determination unit 220 and transmits thedemultiplexed residual signals to the residual block decoding unit 260.

The motion information coding mode determination unit 220 determinesmotion information coding mode of the current block. If skip_flagincluded in a received bit stream has a value of 1, the motioninformation coding mode determination unit 220 determines that motioninformation of the current block has been encoded in skip mode. If theskip_flag included in the received bit stream has a value of 0 andmotion information received from the demultiplexer 210 has only a mergeindex, the motion information coding mode determination unit 220determines that motion information of the current block has been encodedin merge mode. If the skip_flag included in the received bit stream hasa value of 0 and motion information received from the demultiplexer 210has a reference picture index, a differential motion vector, and an AMVPindex, the motion information coding mode determination unit 220determines that motion information of the current block has been encodedin AMVP mode.

The merge mode motion information decoding unit 230 is activated whenthe motion information coding mode determination unit 220 determinesthat motion information of the current block has been encoded in skipmode or merge mode.

The AMVP mode motion information decoding unit 240 is activated when themotion information coding mode determination unit 220 determines thatmotion information of a current block has been encoded in AMVP mode.

The prediction block generation unit 250 generates the prediction blockof the current block using motion information reconstructed by the mergemode motion information decoding unit 230 or the AMVP mode motioninformation decoding unit 240. If a motion vector has an integer pixelunit, the prediction block generation unit 250 generates the predictionblock of the current block by copying a block corresponding to aposition that is indicated by a motion vector within a picture indicatedby a reference picture index. If a motion vector does not have aninteger pixel unit, however, the prediction block generation unit 250generates pixels of a prediction block from an integerpixels within apicture indicated by a reference picture index. In the case of aluminance pixel, a prediction pixel can be generated using an 8-tapinterpolation filter. In the case of a chrominance pixel, a predictionpixel can be generated using a 4-tap interpolation filter.

The residual block decoding unit 260 performs entropy decoding on aresidual signal. Furthermore, the residual block decoding unit 260generates a two-dimensional quantized coefficient block by inverselyscanning entropy-decoded coefficients. An inverse scanning method mayvary based on an entropy decoding method. That is, the inverse scanningmethod of an inter-prediction residual signal in the case of decodingbased on Context-Adaptive Binary Arithmetic Coding (CABAC) may bedifferent from the inverse scanning method of an inter-predictionresidual signal in the case of decoding based on Context-Based AdaptiveVariable Length Coding (CAVLC). For example, a diagonal rasterinverse-scan method can be used in the case of decoding based on CABAC,and a zigzag inverse-scan method can be used in the case of decodingbased on CAVLC. Furthermore, the inverse scanning method may bedetermined based on a size of a prediction block.

The residual block decoding unit 260 inversely quantizes a generatedcoefficient block using an inverse quantization matrix. In order toderive the quantization matrix, a quantization parameter isreconstructed. A quantization step size is reconstructed for each codingunit having a predetermined size or greater. The predetermined size maybe 8×8 or 16×16. Accordingly, if a current coding unit is smaller thanthe predetermined size, only the quantization parameter of the firstcoding unit in coding order, from among a plurality of coding unitswithin the predetermined size, is reconstructed, and the quantizationparameters of the remaining coding units do not need to be coded becausethey are the same as the quantization parameter of the first codingunit.

In order to reconstruct a quantization parameter determined for eachcoding unit having the predetermined size or greater, the quantizationparameter of a coding unit neighboring a current coding unit is used.The first quantization parameter that is valid when scanning isperformed in order of the left coding unit and the upper coding unit ofa current coding unit can be determined as a quantization parameterpredictor of the current coding unit. Furthermore, the firstquantization parameter that is valid when scanning is performed in orderof the left coding unit and the coding unit right before in codingorder, of the current coding unit, can be determined as a quantizationparameter predictor. The quantization parameter of a current predictionunit is reconstructed using the determined quantization parameterpredictor and a differential quantization parameter.

The residual block decoding unit 260 reconstructs a residual block byinversely transforming the inversely quantized coefficient block.

The reconstruction block generation unit 270 generates a reconstructionblock by adding a prediction block generated by the prediction blockgeneration unit 250 and a residual block generated by the residual blockdecoding unit 260.

FIG. 5 is a block diagram of the merge mode motion information decodingunit 230 in accordance with a first embodiment of the present invention.

The merge mode motion information decoding unit 230 in accordance withthe first embodiment of the present invention includes a codeworddetermination unit 231, a spatial merge candidate derivation unit 232, areference picture index derivation unit 233 for a temporal mergecandidate, a motion vector derivation unit 234 for a temporal mergecandidate, a temporal merge candidate configuration unit 235, a mergecandidate list generation unit 236, a merge candidate index decodingunit 237, and a motion information generation unit 238. In this case,the number of merge candidates is not fixed.

The codeword determination unit 231 determines whether there is acodeword corresponding to a merge candidate index or not. If, as aresult of the determination, a codeword corresponding to the mergecandidate index is determined not to be present, the codeworddetermination unit 231 determines that one merge candidate is present ornot present. If, as a result of the determination, one merge candidateis determined not to be present, motion information of a current blockis reconstructed as motion information having a motion vector of 0 and areference picture index of 0. If, as a result of the determination, onemerge candidate is determined to be present, motion information of thecurrent block is reconstructed as motion information of the mergecandidate.

The spatial merge candidate derivation unit 232 sets valid motioninformation of a block that is adjacent to a current block as a spatialmerge candidate. As shown in FIG. 3, four candidates of the left block(e.g., a block A) of a current block, the upper block (e.g., a block B)of the current block, the upper right block (e.g., a block C) of thecurrent block, the lower left block (e.g., a block D) of the currentblock, and the upper left block (e.g., a block E) of the current blockcan be used for setting the spatial merge candidates. In this case, theblock E can be used when one or more of the blocks A, B, C, and D arenot valid.

Furthermore, the left block (e.g., a block N) of a current block, theupper block (e.g., a block B′) of the current block, and the cornerblock (e.g., any one of the blocks C, D, and E) of the current block canbe set as the spatial merge candidates. The corner block is the firstblock that is valid when scanning is performed in order of the upperright block (e.g., a block C), the lower left block (e.g., a block D) ofthe current block, and the upper left block (e.g., a block E) of thecurrent block.

Furthermore, two candidates that are valid when scanning is performed inorder of the left block (e.g., a block A′) of the current block, theupper block (e.g., a block B′) of the current block, the upper rightblock (e.g., a block C) of the current block, the lower left block(e.g., a block D) of the current block, and the upper left block (e.g.,a block E) of the current block can be set as the spatial mergecandidates.

Here, the left block A′ can be a block that does not neighbor the blockD, but neighbors the block E. Likewise, the upper block B′ can be ablock that does not neighbor the block C, but neighbors the block E.

In the aforementioned embodiments, motion information of mergecandidates placed on the upper side of a current prediction unit, fromamong spatial merge candidates, can be differently set based on theposition of the current prediction unit. For example, if the currentprediction unit comes in contact with the upper boundary of an LCU,motion information of the upper prediction unit (e.g., a block B, C orE) of the current prediction unit can be its own motion information ormotion information of a neighbor prediction unit. The motion informationof the upper prediction unit can be determined as its own motioninformation or motion information (e.g., a reference picture index and amotion vector) of a neighbor prediction unit based on the size andposition of the current prediction unit.

The reference picture index derivation unit 233 obtains the referencepicture index of the temporal merge candidates of a current block. Thereference picture index of the temporal merge candidate can be set asthe reference picture index of one of blocks (i.e., prediction units)that spatially neighbor a current block. In another embodiment, thereference picture index of the temporal merge candidate can be set to 0.

In order to obtain the reference indices of the temporal mergecandidates of a current block, some or all of the reference pictureindices of the left block A, the upper block B, the upper right block C,the lower left block D, and the upper left block E of a current blockcan be used.

For example, the reference picture indices of the left block A, theupper block B, and the corner block (e.g., any one of the blocks C, D,and E) of a current block can be used. In this case, the referencepicture index of the first block that is valid when scanning isperformed in order of the upper right block C, the lower left block D,and the upper left block E can be determined as the reference pictureindex of the corner block. For example, a reference picture index havingthe highest frequency, from among valid reference picture indices of thereference picture indices, can be set as the reference picture index ofa temporal skip candidate. If there is a plurality of reference pictureindices having the highest frequency, from among valid candidates, areference picture index having a minimum value, from among the pluralityof reference picture indices, can be set as a reference picture indexfor a temporal skip candidate.

In order to obtain the reference indices of the temporal mergecandidates of a current block, the reference picture indices of threeblocks that are valid when scanning is performed in order of the leftblock A, the upper block B, the upper right block C, the lower leftblock D, and the upper left block E of a current block may be used.Although three or more valid reference picture indices are illustratedas being used, all the valid reference picture indices may be used oronly a reference picture index at a predetermined position may be used.If there is no valid reference picture index, the reference pictureindex may be set to 0.

The motion vector derivation unit 234 determines a picture to which thetemporal merge candidate block belongs (hereinafter referred to as atemporal merge candidate picture). The temporal merge candidate picturecan be set as a picture having a reference picture index of 0. In thiscase, if a slice type is P, the temporal merge candidate picture is setas the first picture included in a list 0 (i.e., a picture having anindex of 0). If a slice type is B, the temporal merge candidate pictureis set as the first picture of a reference picture list indicated by aflag, the flag being indicative of a temporal merge candidate list in aslice header. For example, the temporal merge candidate picture can beset as a picture in a list 0 when the flag is 1 and as a picture in alist 1 when the flag is 0.

The motion vector derivation unit 234 obtains a temporal merge candidateblock within the temporal merge candidate picture. One of a plurality ofcorresponding blocks corresponding to a current block within thetemporal merge candidate picture can be selected as the temporal mergecandidate block. In this case, the order of priority can be assigned tothe plurality of corresponding blocks, and a first valid correspondingblock can be selected as the temporal merge candidate block based on theorder of priority.

For example, a lower left corner block that neighbors a blockcorresponding to a current block within the temporal merge candidatepicture or a lower left block within a block corresponding to a currentblock within the temporal merge candidate picture can be set as a firstcandidate block, and a block that includes an upper left pixel at thecentral position of a block corresponding to a current block within thetemporal merge candidate picture or a block that includes a lower rightpixel at the central position of a block corresponding to a currentblock within the temporal merge candidate picture can be set as a secondcandidate block.

When the first candidate block is valid, the first candidate block canbe set as the temporal merge candidate block. When the first candidateblock is not valid and the second candidate block is valid, the temporalmerge candidate block can be set as the second candidate block. Inanother embodiment, only the second candidate block can be useddepending on the position of a current block. For example, if a currentblock neighbors the lower boundary of a slice or the lower boundary ofan LCU, only the second candidate block can be used. If the secondcandidate block is not present, the temporal merge candidate isdetermined not to be valid.

After the temporal merge candidate prediction block is determined, themotion vector of a temporal merge candidate is set as the motion vectorof the temporal merge candidate prediction block.

Meanwhile, the temporal merge candidate may not be adaptively useddepending on the size of a current block. For example, in the case of a4×4 block, the temporal merge candidate may not be used in order toreduce complexity.

The temporal merge candidate configuration unit 235 determines areference picture index obtained by the reference picture indexderivation unit 233 and a motion vector obtained by the motion vectorderivation unit 234 as the reference picture index and the motion vectorof a temporal merge candidate.

The merge candidate list generation unit 236 generates a list of mergecandidates in predetermined order using valid merge candidates. If aplurality of merge candidates has the same motion information (e.g., thesame motion vector and the same reference picture index), mergecandidates having lower order of priority are deleted from the list. Forexample, the predetermined order can be order of blocks A, B, Col, C,and D. Here, Col means a temporal merge candidate. If one or more of theblocks A, B, C, and D are not valid, motion information of a valid blockE can be inserted into the position of the invalid first block.Furthermore, the motion information of the valid block E can be insertedinto the last position.

The merge candidate index decoding unit 237 selects a decoding tablecorresponding to the number of valid candidates obtained by the mergecandidate list generation unit 236. Furthermore, the merge candidateindex decoding unit 237 determines an index, corresponding to the mergecandidate codeword within the decoding table, as the merge candidateindex of a current block.

The motion information generation unit 238 selects a merge predictor,corresponding to the merge candidate index, from the list generated bythe merge candidate list generation unit 236 and determines motioninformation (i.e., a motion vector and a reference picture index) of theselected merge predictor as motion information of a current block.

FIG. 6 is a block diagram of the merge mode motion information decodingunit 230 in accordance with a second embodiment of the presentinvention.

The merge mode motion information decoding unit 230 in accordance withthe second embodiment of the present invention includes a mergepredictor index decoding unit 331, a spatial merge candidate derivationunit 332, a reference picture index derivation unit 333 for a temporalmerge candidate, a motion vector derivation unit 334 for a temporalmerge candidate, a temporal merge candidate configuration unit 335, amerge predictor selection unit 336, and a motion information generationunit 337. In this case, it is assumed that the number of mergecandidates is fixed. The number of merge candidates can be fixed foreach picture or slice.

The merge predictor index decoding unit 331 reconstructs a mergepredictor index, corresponding to a received merge predictor codeword,using a predetermined table corresponding to the number of mergecandidates.

The operation of the spatial merge candidate derivation unit 332 is thesame as that of the spatial merge candidate derivation unit 232 shown inFIG. 5, and thus a description thereof is omitted.

The operations of the reference picture index derivation unit 333, themotion vector derivation unit 334, and the temporal merge candidateconfiguration unit 335 are the same as those of the reference pictureindex derivation unit 233, the motion vector derivation unit 234, andthe temporal merge candidate configuration unit 235 shown in FIG. 5,respectively, and thus a description thereof is omitted.

The merge predictor selection unit 336 selects a merge candidate,corresponding to a merge predictor index reconstructed by the mergepredictor index decoding unit 331, from a list of merge candidates andselects the selected merge candidate as the merge predictor of a currentblock. The list of merge candidates is generated using valid mergecandidate. In this case, if a plurality of merge candidates has the samemotion information (e.g., the same motion vector and the same referencepicture index), merge candidates having lower order of priority aredeleted from the list. For example, the predetermined order can be orderof blocks A, B, Col, C, and D. Here, Col means a temporal mergecandidate. However, if one or more of the blocks A, B, C, and D are notvalid, motion information of a valid block E can be inserted into theposition of the invalid first block. Furthermore, the motion informationof the valid block E can be inserted into the last position.

Meanwhile, if the number of merge candidates is smaller than apredetermined number, a merge candidate can be generated. The addedmerge candidate can be generated by combining motion information of twovalid merge candidates. For example, a merge candidate can be generatedby combining the reference picture index of a temporal merge candidateand the valid spatial motion vector of a spatial merge candidate. If aplurality of merge candidates can be generated, the generated mergecandidates can be added to a list in predetermined order. A mergecandidate generated by combining the reference picture index of atemporal merge candidate and the motion vector of a spatial mergecandidate can be first added to a list. If the number of mergecandidates to be generated is insufficient, a merge candidate having amotion vector of 0 and a reference picture index of 0 may be added. Thepredetermined number can be determined for each picture or slice.

The motion information generation unit 337 selects a merge predictor,corresponding to the merge candidate index, from the list generated bythe merge candidate list generation unit 236 and determines motioninformation (i.e., a motion vector and a reference picture index) of theselected merge predictor as motion information of a current block.

FIG. 7 is a block diagram of the merge mode motion information decodingunit 230 in accordance with a third embodiment of the present invention.

The merge mode motion information decoding unit 230 in accordance withthe third embodiment of the present invention further includes a mergecandidate generation unit 437 that is added to the configuration of themerge mode motion information decoding unit 230 in accordance with thesecond embodiment of the present invention. Accordingly, the operationsof a merge predictor index decoding unit 431, a spatial merge candidatederivation unit 432, a reference picture index derivation unit 433 for atemporal merge candidate, a motion vector derivation unit 434 for atemporal merge candidate, a temporal merge candidate configuration unit435, a merge predictor selection unit 436, and a motion informationgeneration unit 438 are the same as those of the second embodiment, andthus a description thereof is omitted.

The merge candidate generation unit 437 can generate a merge candidatewhen the number of merge candidates is smaller than a predeterminednumber. In this case, an added merge candidate can be generated bycombining motion information of two valid merge candidates. For example,an added merge candidate can be generated by combining the referencepicture index of a temporal merge candidate and the valid spatial motionvector of a spatial merge candidate. If a plurality of merge candidatescan be generated, the plurality of merge candidates can be added to alist in predetermined order. A merge candidate generated by combiningthe reference picture index of a temporal merge candidate and the motionvector of a spatial merge candidate can be first added to a list. Thenumber of merge candidates added as described above can bepredetermined. If the number of merge candidates to be generated isinsufficient, a merge candidate having a motion vector of 0 and areference picture index of 0 may be added to the list. The predeterminednumber can be determined for each picture or slice.

The merge predictor selection unit 436 obtains a list of mergecandidates using a spatial merge candidate derived by the spatial mergecandidate derivation unit 432, a temporal merge candidate generated bythe temporal merge candidate configuration unit 435, and mergecandidates generated by the merge candidate generation unit 437. If aplurality of merge candidates has the same motion information (i.e., thesame motion vector and the same reference picture index), a mergecandidate having a lower order of priority is deleted from the list. Forexample, a predetermined order is order of A, B, Col, C, and D. Here,Col means a temporal merge candidate. However, if one or more of A, B,C, and D are not valid, motion information on a valid block E can beinserted into the position of the first invalid block. Furthermore, themotion information of the valid block E can be inserted into the lastposition. The merge predictor selection unit 436 selects a mergecandidate, corresponding to a merge index reconstructed by the mergepredictor index decoding unit 431, from the list of merge candidates andselects the selected merge candidate as the merge predictor of a currentblock.

FIG. 8 is a block diagram of an AMVP mode motion information decodingunit in accordance with a first embodiment of the present invention.

The AMVP mode motion information decoding unit in accordance with thefirst embodiment of the present invention includes an AMVP predictorindex decoding unit 341, a residual motion information reading unit 342,a spatial AMVP candidate derivation unit 343, a temporal AMVP candidatederivation unit 344, an AMVP predictor selection unit 345, a motionvector predictor generation unit 346, and a motion informationgeneration unit 347. The present embodiment is applied when the numberof AMVP candidates is variable.

The AMVP predictor index decoding unit 341 determines whether there is acodeword corresponding to an AMVP predictor index or not. If, as aresult of the determination, a codeword corresponding to an AMVPpredictor index is determined not to be present, the AMVP predictorindex decoding unit 341 determines that one AMVP candidate is present ornot present. If an AMVP candidate is determined not to be present, themotion vector predictor generation unit 346 reconstructs a motion vectorof 0 into the motion vector of a current block. In contrast, if one AMVPcandidate is determined to be present, the motion vector predictorgeneration unit 346 reconstructs the motion vector of the AMVP candidateinto the motion vector of a current block.

The residual motion information reading unit 342 reads the referencepicture index and differential motion vector of a current block.

The spatial AMVP candidate derivation unit 343 can select one of theleft block (e.g., a block A) and lower left block (e.g., a block D) of acurrent block as a left spatial candidate and select one of the upperblock (e.g., a block B) of the current block, the upper right block(e.g., a block C) of the current block, and the upper left block (e.g.,a block E) of the current block as an upper spatial candidate. Here, themotion vector of the first block that is valid when scanning isperformed in predetermined order is selected as the candidate. Thepredetermined order can be order of the block A and the block D or areverse order thereof in the case of a left block and can be order ofthe block B, the block C, and the block E or order of the block C, theblock B, and the block E in the case of an upper block. The position ofthe block of the AMVP candidate is identical with the position of theblock of a merge candidate.

The temporal AMVP candidate derivation unit 344 obtains a temporal mergecandidate using the motion vector of a temporal merge candidate obtainedby the motion vector derivation unit 123 of FIG. 2.

The AMVP predictor selection unit 345 generates a list using valid AMVPcandidates derived by the spatial AMVP candidate derivation unit 343 andthe temporal AMVP candidate derivation unit 344. The AMVP predictorselection unit 345 generates a list of AMVP candidates in predeterminedorder using the valid AMVP candidates. In this case, if a plurality ofAMVP candidates has the same motion vector (here, the plurality of AMVPcandidates does not need to have the same reference picture), AMVPcandidates having a lower order of priority are deleted from the list.The predetermined order can be order of the left side, the upper side,and Col or can be order of Col, the left side, and the upper side.

Furthermore, the AMVP predictor selection unit 345 selects a decodingtable corresponding to the number of valid AMVP candidates within thegenerated list and selects the AMVP predictor of a current block usingthe selected decoding table.

The motion vector predictor generation unit 346 determines the motionvector of a candidate, selected by the AMVP predictor selection unit345, as a motion vector predictor of a current block.

The motion information generation unit 347 generates the motion vectorof a current block by adding a motion vector predictor generated by themotion vector generation unit 346 and a differential motion vector readby the residual motion information reading unit 342. Furthermore, themotion information generation unit 347 sets a reference picture index,read by the residual motion information reading unit 342, as thereference picture index of the current block.

FIG. 9 is a block diagram of an AMVP mode motion information decodingunit in accordance with a second embodiment of the present invention.

The AMVP mode motion information decoding unit in accordance with thesecond embodiment of the present invention includes an AMVP predictorindex decoding unit 441, a residual motion information reading unit 442,a spatial AMVP candidate derivation unit 443, a temporal AMVP candidatederivation unit 444, an AMVP predictor selection unit 445, an AMVPcandidate generation unit 446, a motion vector predictor generation unit447, and a motion information generation unit 448. The presentembodiment is applied when the number of AMVP candidates is variable.

The operations of the AMVP predictor index decoding unit 441, theresidual motion information reading unit 442, the spatial AMVP candidatederivation unit 443, the temporal AMVP candidate derivation unit 444,the AMVP predictor selection unit 445, the motion vector predictorgeneration unit 447, and the motion information generation unit 448 arethe same as those of the respective elements of FIG. 11, and thus adescription thereof is omitted.

The AMVP candidate generation unit 446 determines whether it isnecessary to generate an AMVP candidate or not. Assuming that the numberof AMVP candidates is set to a fixed value in the above AMVP candidateconfiguration, if the number of valid AMVP candidates is smaller than afixed value, an AMVP candidate is generated. Furthermore, the generatedAMVP candidate is added to a position next to an AMVP candidate havingthe lowest order of priority in a list. If a plurality of AMVPcandidates is sought to be added, the plurality of AMVP candidates isadded in predetermined order. The added AMVP candidates can include acandidate having a motion vector of 0.

The AMVP predictor selection unit 445 generates a list of AMVPcandidates using a spatial AMVP candidate derived by the spatial AMVPcandidate derivation unit 443, a temporal AMVP candidate generated bythe temporal AMVP candidate derivation unit 444, and AMVP candidatesgenerated by the AMVP candidate generation unit 446. If a plurality ofAMVP candidates has the same motion vector (i.e., the same motion vectorand the same reference picture index), AMVP candidates having a lowerorder of priority are deleted from the list. The predetermined order canbe order of the left side, the upper side, and Col or can be order ofCol, the left side, and the upper side. Furthermore, a decoding tablecorresponding to the number of valid AMVP candidates in the generatedlist is selected, and the AMVP predictor of a current block is selectedusing the selected decoding table.

Although the some exemplary embodiments of the present invention havebeen described, a person having ordinary skill in the art willappreciate that the present invention may be modified and changed invarious manner without departing from the spirit and scope of thepresent invention which are written in the claims below.

1. An apparatus for decoding motion information in merge mode,comprising: a merge mode motion information decoding unit configured todecode motion information using available spatial and temporal mergecandidates when a motion information encoding mode of a current blockindicates a merge mode; a prediction block generation unit configured togenerate a prediction block of the current block using the decodedmotion information; and a residual block decoding unit configured togenerate a quantization block by inversely scanning residual signals,inversely quantize the quantization block using a quantizationparameter, and generate a residual block by inversely transforming theinverse-quantized block, wherein when the current block is not adjacentto a lower boundary of a largest coding unit, a motion vector of a firstmerge candidate block is determined as a motion vector of the temporalmerge candidate if the motion vector of the first merge candidate blockis available and a motion vector of a second merge candidate block isdetermined as the motion vector of the temporal merge candidate if themotion vector of the first merge candidate block is unavailable.
 2. Theapparatus of claim 1, wherein when the current block is adjacent to alower boundary of the largest coding unit, the motion vector of thesecond merge candidate block is selected as the motion vector of thetemporal merge candidate.
 3. The apparatus of claim 1, wherein areference picture index of the temporal merge candidate is set as areference picture index of one of neighboring block or
 0. 4. Theapparatus of claim 1, wherein the first and second merge candidateblocks are included in a temporal merge candidate picture and thetemporal merge candidate picture is determined differently based on aslice type.
 5. The apparatus of claim 1, wherein if the number of theavailable spatial and temporal merge candidates is smaller than apredetermined number, one or more merge candidates are generated.